How to design Trellis Codes with Large Distance Properties
نویسنده
چکیده
We present a novel method for constructing trellis codes, based on recursive nonlinear equations. Using this method, trellis codes having good code rates (R = k/n) can be constructed. At the same time, the method allows the code-designer to construct a trellis with a large free distance, dfree, at the cost of a larger number of states in the trellis. It has been shown in this paper that for the code rate, R, less than a critical rate, Rc, the free distance can be made as large as desired for large n. This design methodology provides the freedom to play with the code performance and the code rate of the trellis code. Using this method, a rate 3/4 trellis code has been constructed with dfree = 12. Key-Words:Trellis Codes, Free Distance, Error Control Codes
منابع مشابه
Trellis-Coded Quantization Based on Maximum-Hamming-Distance Binary Codes
Most design approaches for trellis-coded quantization take advantage of the duality of trellis-coded quantization with trellis-coded modulation, and use the same empiricallyfound convolutional codes to label the trellis branches. This letter presents an alternative approach that instead takes advantage of maximum-Hamming-distance convolutional codes. The proposed source codes are shown to be co...
متن کاملLexicographic Codes: Constructions Bounds, and Trellis Complexity
We study lexicographic codes, which are generated by an iterative greedy construction. We analyze the relationship between successive iterations in this construction, and derive bounds on the parameters of the resulting codes that are tighter than the presently known bounds. Furthermore, we generalize the lexico-graphic construction to produce families of codes that combine the excellent rate a...
متن کاملLower bounds on trellis complexity of block codes
Abstruct-The trellis state-complexity s of a linear block code is defined as the logarithm of the maximum number of states in its minimal trellis. We present a new lower bound on the statecomplexity of linear codes, which includes most of the existing bounds as special cases. The new bound is obtained by dividing the time axis for the code into several sections of varying lengths, as opposed to...
متن کاملWeighted Space Time Trellis Code for Slow Nakagami Fading Channel
It has been well known that the suitable criteria for Space time trellis codes (STTC) designed over slow Nakagami fading channel for product of rank and number of receiver antennas ) are maximization of minimum rank and maximize the minimum product of nonzero eigenvalues for rank and determinant criteria. But for large product i.e. for ), the design of codes with minimum error probability and m...
متن کاملSystematic Design of Space-Time Trellis Codes for Diversity and Coding Advantages
The emerging need for high data rate wireless services has raised considerable interest in space-time coding. In this work, we propose a systematic code construction method that jointly considers diversity advantage and coding advantage for an arbitrary number of transmit antennas and any memoryless constellation. Our approach is to directly assign channel symbols to transmit antennas at differ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005